Edge-superconnectivity of semiregular cages with odd girth
نویسندگان
چکیده
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges incident with some vertex of minimum degree. A graph G is said to be a {d, d + 1}semiregular graph if all its vertices have degree either d or d+1. A smallest {d, d+1}-semiregular graph G with girth g is said to be a ({d, d+1}; g)-cage. We show that every ({d, d+1}; g)-cage with odd girth g is edge-superconnected.
منابع مشابه
Biregular Cages of Girth Five
Let 2 6 r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of minimum order n({r,m}; g). If m = r+1, an ({r,m}; g)–cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from [M. Abreu, G. Araujo–Pardo, C. ...
متن کاملA Note on the Edge-Connectivity of Cages
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the smallest possible number of vertices. In this paper we prove that (k; g)cages are k-edge-connected if k ≥ 3 and g is odd.
متن کاملOn the connectivity of cages with girth five, six and eight
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices. Recently, some authors have addressed the problem of studying their connectivity parameters. In this direction, it was conjectured by Fu, Huang and Rodger that every (δ, g)-cage is maximally connected, i.e., it is δ-connected, and they proved this statement for δ = 3. We provide a new contributi...
متن کاملOn superconnectivity of (4, g)-cages with even girth
A (k, g)-cage is a k-regular graph with girth g that has the fewest number of vertices. It has been conjectured [Fu, Huang, and Rodger, Connectivity of cages, J. Graph Theory 24 (1997), 187-191] that all (k, g)-cages are k-connected for k ≥ 3. A connected graph G is said to be superconnected if every minimum cut-set S is the neighborhood of a vertex of minimum degree. Moreover, if G − S has pre...
متن کاملSuperconnectivity of regular graphs with small diameter
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D ≤ g − 2, then the graph is super-κ when g ≥ 5 and a complete graph otherwise.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 58 شماره
صفحات -
تاریخ انتشار 2011